Graph colorings with restricted bicolored subgraphs: II. The graph coloring game
نویسندگان
چکیده
We consider the graph coloring game, a game in which two players take turns properly vertices of graph, with one player attempting to complete proper coloring, and other prevent coloring. show that if G has number each bicolored subgraph is bounded, then chromatic bounded. As corollary this result, we for graphs 1 2 bounded number, Cartesian product □ answering question X. Zhu. also obtain an upper bound on strong ⊠ graphs.
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولColoring Subgraphs of the Rado Graph
Given a universal binary countable homogeneous structure U and n ∈ ω, there is a partition of the induced n-element substructures of U into finitely many classes so that for any partition C0, C1, . . . , Cm−1 of such a class Q into finitely many parts there is a number k ∈ m and a copy U∗ of U in U so that all of the induced n-element substructures of U∗ which are in Q are also in Ck. The parti...
متن کاملPlanar graph coloring avoiding monochromatic subgraphs: trees
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem. We present a complete picture for the case with a single forbidden connected (induced or noninduced) subgraph. The 2-coloring problem is NP-hard if the forbidde...
متن کاملEfficient Graph Packing via Game Coloring
The game coloring number gcol(G) of a graph G is the least k such that if two players take turns choosing the vertices of a graph then either of them can insure that every vertex has less than k neighbors chosen before it, regardless of what choices the other player makes. Clearly gcol(G) ≤ ∆(G) + 1. Sauer and Spencer [20] proved that if two graphs G1 and G2 on n vertices satisfy 2∆(G1)∆(G2) < ...
متن کاملA Note on Graph Coloring Extensions and List-Colorings
Let G be a graph with maximum degree ∆ ≥ 3 not equal to K∆+1 and let P be a subset of vertices with pairwise distance, d(P ), between them at least 8. Let each vertex x be assigned a list of colors of size ∆ if x ∈ V \P and 1 if x ∈ P . We prove that it is possible to color V (G) such that adjacent vertices receive different colors and each vertex has a color from its list. We show that d(P ) c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22786